Batch Verification for Equality of Discrete Logarithms and Threshold Decryptions
نویسندگان
چکیده
A general technique of batch verification for equality of discrete logarithms is proposed. Examples of batching threshold decryption schemes are presented based on threshold versions of three popular cryptosystems ElGamal, RSA and Paillier. Our technique offers large computational savings when employed in schemes with a large number of ciphertexts to be decrypted, such as in e-voting or e-auction schemes using threshold decryption. The resulting effect is beneficial for producing more efficient schemes.
منابع مشابه
Batch Proofs of Partial Knowledge
We present a practical attack on the soundness of Peng and Bao’s ‘batch zero-knowledge proof and verification’ protocol for proving knowledge and equality of one-out-of-n pairs of discrete logarithms. Fixing the protocol seems to require a commitment scheme with a nonstandard, mercurial-esque binding property: the prover commits to just n− 1 values, but later opens the commitment to n values wi...
متن کاملID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero knowledge proof for the equality of two discrete logarithms based on the bilinear map. In this scheme, any third party can verify the validity of the signature, but only more than t members in the recipient group can coope...
متن کاملMeta-He digital signatures based on factoring and discrete logarithms
This study investigates all variations of the He’s digital signature scheme based on factoring and discrete logarithms. In contrast to three modular exponentiation computation, the optimal two schemes of generalized He’s signature verification reveals that only two modular exponentiation is needed for signature verification. Key-Words: Digital signature, Batch verify, Computation complexity.
متن کاملBatch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other’s signatures without exchanging public key certificates. With the advent of Bilinear maps, several ID-based signatures based on the discrete logarithm problem have been proposed. While these signatures have an advantage in the fact that the system secret can be shared by several parties using a threshold schem...
متن کاملUniversal Custodian-Hiding Verifiable Encryption for Discrete Logarithms
We introduce the notion of Universal Custodian-Hiding Verifiable Encryption (UCH-VE) and propose a scheme of this type for discrete logarithms. A UCH-VE scheme allows an encryptor to designate t out of a group of n users and prepare a publicly verifiable ciphertext in such a way that any k of these t designated users can recover the message. The values of k and t are set arbitrarily by the encr...
متن کامل